package leetcode.leetcode6xx.leetcode628;

import org.junit.jupiter.api.Test;

import static org.junit.jupiter.api.Assertions.assertEquals;

class SolutionTest {

    @Test
    void maximumProduct() {
        int[] num = {-135, -73, 496, -515, -519, -773, -40, -411, -991, -260, 427, -67, 77, 452, 279, 556, -799, 656, -482, 144, -354, 439, -284, 865, -917, 813, 223, -342, -779, -892, 536, -896, -141, -180, 279, -666, -133, -667, -533, 770, 599, 464, 408, -243, 33, -812, -398, 33, -516, 528, -209, 861, 637, -514, -18, 642, -33, -46, 243, 710, 778, -902, 299, -213, 817, -344, -425, 892, 837, -320, -956, -267, 625, -114, 350, -722, 835, 825, 82, -741, -419, -664, 135, -260, -320, -259, -513, -595, 161, -663, -389, 402, -233, 40, -829, 695, -271, -663, 457, -294};
        assertEquals(845077232, new Solution().maximumProduct(num));

    }
}